Lineability of Linearly Sensitive Functions
نویسندگان
چکیده
منابع مشابه
Lineability, Spaceability, and Additivity Cardinals for Darboux-like Functions
We introduce the concept of maximal lineability cardinal number, mL(M), of a subset M of a topological vector space and study its relation to the cardinal numbers known as: additivity A(M), homogeneous lineability HL(M), and lineability L(M) of M . In particular, we will describe, in terms of L, the lineability and spaceability of the families of the following Darboux-like functions on Rn, n ≥ ...
متن کاملLinearly decodable functions from neural population codes
The population vector is a linear decoder for an ensemble of neurons, whose response properties are nonlinear functions of the input vector. However, previous analyses of this decoder seem to have missed the obsevation that the population vector can also be used to estimate functions of the input vector. We explore how to use singular value decomposition to delineate the class of functions whic...
متن کاملLinearly Solvable Stochastic Control Lyapunov Functions
This paper presents a new method for synthesizing stochastic control Lyapunov functions for a class of nonlinear stochastic control systems. The technique relies on a transformation of the classical nonlinear Hamilton–Jacobi–Bellman partial differential equation to a linear partial differential equation for a class of problems with a particular constraint on the stochastic forcing. This linear ...
متن کاملBanach-Steinhaus theory revisited: Lineability and spaceability
In this paper we study the divergence behavior of linear approximation processes in general Banach spaces. We are interested in the structure of the set of divergence creating functions. The Banach–Steinhaus theory gives some information about this set, however, it cannot be used to answer the question whether this set contains subspaces with linear structure. We give necessary and sufficient c...
متن کاملAn Algorithm for Global Minimization of Linearly Constrained Quadratic Functions
A branch and bound algorithm is proposed for finding an approximate global optimum of quadratic functions over a bounded polyhedral set. The algorithm uses Lagrangian duality to obtain lower bounds. Preliminary computational results are reported.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Results in Mathematics
سال: 2020
ISSN: 1422-6383,1420-9012
DOI: 10.1007/s00025-020-01187-3